Exact Learning from an Honest Teacher That Answers Membership Queries
نویسنده
چکیده
Given a teacher that holds a function f : X → R from some class of functions C. The teacher can receive from the learner an element d in the domain X (a query) and returns the value of the function in d, f(d) ∈ R. The learner goal is to find f with a minimum number of queries, optimal time complexity, and optimal resources. In this survey, we present some of the results known from the literature, different techniques used, some new problems, and open problems. ar X iv :1 70 6. 03 93 5v 1 [ cs .L G ] 1 3 Ju n 20 17
منابع مشابه
Separating Models of Learning with Faulty Teachers
We study the power of two models of faulty teachers in Valiant’s PAC learning model and Angluin’s exact learning model. The first model we consider is learning from an incomplete membership oracle introduced by Angluin and Slonim (1994). In this model, the answers to a random subset of the learner’s membership queries may be missing. The second model we consider is random persistent classificat...
متن کاملLearning First-Order Definite Theories via Object-Based Queries
We study the problem of exact learning of first-order definite theories via queries, toward the goal of allowing humans to more efficiently teach first-order concepts to computers. Prior work has shown that first order Horn theories can be learned using a polynomial number of membership and equivalence queries [6]. However, these query types are sometimes unnatural for humans to answer and only...
متن کاملExact Learning of Subclasses of CDNF Formulas with Membership Queries
We consider the exact learnability of subclasses of Boolean formulas from membership queries alone. We show how to combine known learning algorithms that use membership and equivalence queries to obtain new learning results only with memberships. In particular we show the exact learnability of read-k monotone formulas, Sat-k O(log n)-CDNF, and O(p log n)-size CDNF from membership queries only.
متن کاملLearning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries
We present results concerning the learning of Monotone DNF (MDNF) from Incomplete Membership Queries and Equivalence Queries. Our main result is a new algorithm that allows efficient learning of MDNF using Equivalence Queries and Incomplete Membership Queries with probability of p = 1 − 1/poly(n, t) of failing. Our algorithm is expected to make
متن کاملThe Complexity of Exactly Learning
In this paper, we investigate the complexity of exact-learning classes of permutation groups and linear spaces over nite elds. These concept classes can be seen as special subclasses of the concept class of circuits. It turns out that in Angluin's exact-learning model these concept classes are learnable with equivalence queries but not learnable with membership queries, indeed not even exact le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.03935 شماره
صفحات -
تاریخ انتشار 2017